Subword histories and associated matrices
نویسندگان
چکیده
منابع مشابه
Subword histories and associated matrices
The basic numerical quantity investigated in this paper is |w|u, the number of occurrences of a word u as a scattered subword of a word w. Arithmetical combinations of such quantities yield a so-called subword history. We investigate the information content of subword histories. Reducing subword histories to linear ones, as well as the recently introduced Parikh matrices, will be important tool...
متن کاملOn Inequalities between Subword Histories
By taking out letters from a word we get a subword. Both continuous sub-words (also called factors or simply subwords) and scattered subwords were extensively studied. In [4] the authors introduced Parikh matrices, structures that contain more information about the words than Parikh vectors, which tell us only the number of di $ffere\tau 1T$ letters building the word. $I_{l1}[5]$ the notion of ...
متن کاملE-Clean Matrices and Unit-Regular Matrices
Let $a, b, k,in K$ and $u, v in U(K)$. We show for any idempotent $ein K$, $(a 0|b 0)$ is e-clean iff $(a 0|u(vb + ka) 0)$ is e-clean and if $(a 0|b 0)$ is 0-clean, $(ua 0|u(vb + ka) 0)$ is too.
متن کاملSubword complexities and iteration
This paper is an overview of results' on the subword complexity of various classes of languages obtained by iterating a mapping, and more precisely on the asymptotic behaviour of this complexity. In the first section we consider iterated morphisms, that is DOL languages. In this area the subword complexity falls into one of five classes, and class membership can be determined. The second sectio...
متن کاملBohmian Histories and Decoherent Histories
The predictions of the Bohmian and the decoherent (or consistent) histories formulations of the quantum mechanics of a closed system are compared for histories — sequences of alternatives at a series of times. For certain kinds of histories, Bohmian mechanics and decoherent histories may both be formulated in the same mathematical framework within which they can be compared. In that framework, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.05.023